SEH: Size Estimate Hedging for Single-Server Queues
نویسندگان
چکیده
For a single server system, Shortest Remaining Processing Time (SRPT) is an optimal size-based policy. In this paper, we discuss scheduling single-server system when exact information about the jobs' processing times not available. When SRPT policy uses estimated times, underestimation of large jobs can significantly degrade performance. We propose simple heuristic, Size Estimate Hedging (SEH), that only for decisions. A job's priority increased dynamically according to rule until it determined underestimated, at which time frozen. Numerical results suggest SEH has desirable performance estimation error variance consistent with what seen in practice.
منابع مشابه
stationary single-server queues
This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...
متن کاملSome Inequalities for Single Server Queues
The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...
متن کاملFairness and Scheduling in Single Server Queues
Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the last decade a...
متن کاملSingle-server queues with spatially distributed arrivals
Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server’s movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The se...
متن کاملA unifying onservation law for single-server queues
Urtzi Ayesta LAAS-CNRS 7, Avenue Colonel Ro he 31077, Toulouse e-mail: urtzi laas.fr Abstra t We develop a onservation law for a multilass GI/GI/1 queue operating under a general workonserving s heduling dis ipline. For singlelass single-server queues, onservation laws have been obtained for both non-anti ipating and anti ipating dis iplines with general servi e time distributions. For multilas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-85172-9_9